Hard coloring problems in low degree planar bipartite graphs
نویسندگان
چکیده
منابع مشابه
Hard coloring problems in low degree planar bipartite graphs
In this paper we prove that the PRECOLORING EXTENSION problem on graphs of maximum degree 3 is polynomially solvable, but even its restricted version with 3 colors is NP-complete on planar bipartite graphs of maximum degree 4. The restricted version of LIST COLORING, in which the union of all lists consists of 3 colors, is shown to be NP-complete on planar 3-regular bipartite graphs. © 2006 Els...
متن کاملStar coloring bipartite planar graphs
A star coloring of a graph is a proper vertex-coloring such that no path on four vertices is 2-colored. We prove that the vertices of every bipartite planar graph can be star colored from lists of size 14, and we give an example of a bipartite planar graph that requires at least 8 colors to star color.
متن کاملEdge-Coloring Bipartite Graphs
Given a bipartite graph G with n nodes, m edges and maximum degree ∆, we find an edge coloring for G using ∆ colors in time T +O(m log ∆), where T is the time needed to find a perfect matching in a k-regular bipartite graph with O(m) edges and k ≤ ∆. Together with best known bounds for T this implies an O(m log ∆ + m ∆ log m ∆ log ∆) edge-coloring algorithm which improves on the O(m log ∆+ m ∆ ...
متن کاملThe Degree/Diameter Problem in Maximal Planar Bipartite graphs
The (∆, D) (degree/diameter) problem consists of finding the largest possible number of vertices n among all the graphs with maximum degree ∆ and diameter D. We consider the (∆, D) problem for maximal planar bipartite graphs, that are simple planar graphs in which every face is a quadrangle. We prove that for the (∆, 2) problem, the number of vertices is n = ∆ + 2; and for the (∆, 3) problem, n...
متن کاملOn total 9-coloring planar graphs of maximum degree seven
Given a graphG, a total k-coloring ofG is a simultaneous coloring of the vertices and edges ofGwith at most k colors. If ∆(G) is themaximum degree ofG, then no graph has a total ∆-coloring, but Vizing conjectured that every graph has a total (∆ + 2)-coloring. This Total Coloring Conjecture remains open even for planar graphs. This article proves one of the two remaining planar cases, showing th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2006.03.014